A fourier inversion formula for evolutionary trees
نویسندگان
چکیده
منابع مشابه
A Fourier Inversion Formula for Evolutionary Trees
We establish a pair of identities, which will provide a useful tool in the reconstruction of evolutionary trees in Kimura's 3-parameter model. The starting point of this paper was an attempt for a better understanding and generalization of an Hadamard inverse pair of formulae, which was used in statistics by Cooper [l], in image processing by Andrews [2, Chapters 6,7], and in information theory...
متن کاملInversion Formula for Continuous Multifractals
In a previous paper MR the authors introduced the inverse measure y of a probability measure on It was argued that the respective multifractal spectra are linked by the inversion formula fy f Here the statements of MR are put in more mathematical terms and proofs are given for the inversion formula in the case of continuous measures Thereby f may stand for the Hausdor spectrum the packing spect...
متن کاملThe Möbius inversion formula for Fourier series applied to Bernoulli and Euler polynomials
Hurwitz found the Fourier expansion of the Bernoulli polynomials over a century ago. In general, Fourier analysis can be fruitfully employed to obtain properties of the Bernoulli polynomials and related functions in a simple manner. In addition, applying the technique of Möbius inversion from analytic number theory to Fourier expansions, we derive identities involving Bernoulli polynomials, Ber...
متن کاملA multivariate hook formula for labelled trees
Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The righthand side can be written nicely as a product of linear factors. We study two specializations of this new formula, including Cayley’s enumeration of trees with respect to vertex deg...
متن کاملA Refinement of Cayley's Formula for Trees
which reduce to (n + 1) for a = b = c = 1. We refine Cayley’s formula by showing that Pn(a, b, c) counts rooted forests by the number of trees and the number of proper vertices, which are vertices that are less than all of their proper descendants. Moreover, other evaluations of Pn(a, b, c) have similar interpretations for other types of trees and forests: k-ary trees, forests of ordered trees,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1993
ISSN: 0893-9659
DOI: 10.1016/0893-9659(93)90004-7